Signal modeling using the gradient search

This letter presents a new method for continuous signal modeling. Firstly, the continuous signal can be represented as a function of the trigonometric functional extension (Fourier series). Fourier series of the signal are parameterized by the fundamental frequency and unknown parameters. Then, the gradient-based iterative identification algorithm is derived, for estimating parameters of the signal model with known and unknown frequencies, separately. Finally, the simulation results indicate that the proposed algorithm is effective.     

Modified two-grid method for solving coupled Navier-Stokes/Darcy model based on Newton iteration

A new decoupled two-gird algorithm with the Newton iteration is proposed for solving the coupled Navier-Stokes/Darcy model which describes a fluid flow filtrating through porous media. Moreover the err...     

A Mixed Mann Iteration Process for Fixed Points of Mixed Increasing Operators in Ordered Banach Spaces

In this paper, we develop a new mixed Mann iteration process to approximate the fixed points of mixed increasing operators in ordered Banach spaces and discuss the convergence analysis of the iterative sequences generated by the iteration process. As an application, we develop a new iterative method for solving a class of nonlinear integral equations.     

Optimal Synthesis of Steel Frameworks Using Standard Sections* †

This paper presents a computer-based method for optimally sizing members of planar steel frameworks using commercially available standard sections. For first-order behavior and static loads, a minimum-weight structure is found while simultaneously ensuring stress and displacement performance conditions under applied service loads. Architectural conditions are imposed on section sizes to satisfy fabrication requirements related to member continuity and structure symmetry. The design method presented is iterative in nature and remarkably efficient. The number of iterations is generally quite small and almost totally independent: of the complexity of the structure. Designs are presented for two steel frameworks that are typical of those encountered in professional practise.     

Explicit iteration and unbounded solutions for fractional integral boundary value problem on an infinite interval

By employing the monotone iterative technique, we not only establish the existence of the unique solution for a fractional integral boundary value problem on semi-infinite intervals, but also develop an explicit iterative sequence for approximating the solution and give an error estimate for the approximation, which is an important improvement of existing results.     

A new subspace iteration method for the algebraic Riccati equation

We consider the numerical solution of the continuous algebraic Riccati equation A*X + XA ? XFX + G = 0, with F = F*,G = G* of low rank and A large and sparse. We develop an algorithm for the low‐rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix. We show that the sought‐after approximation can be obtained by a low‐rank update, in the style of the well known Alternating Direction Implicit (ADI) iteration for the linear equation, from which the new method inherits many algebraic properties. Moreover, we establish new insightful matrix relations with emerging projection‐type methods, which will help increase our understanding of this latter class of solution strategies. Copyright © 2014 John Wiley & Sons, Ltd.     

Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces

In recent years, Landweber iteration has been extended to solve linear inverse problems in Banach spaces by incorporating non-smooth convex penalty functionals to capture features of solutions. This method is known to be slowly convergent. However, because it is simple to implement, it still receives a lot of attention. By making use of the subspace optimization technique, we propose an accelerated version of Landweber iteration with non-smooth convex penalty which significantly speeds up the method. Numerical simulations are given to test the efficiency.     

On global stability of an HIV pathogenesis model with cure rate

In this paper, applying both Lyapunov function techniques and monotone iterative techniques, we establish new sufficient conditions under which the infected equilibrium of an HIV pathogenesis model with cure rate is globally asymptotically stable. By giving an explicit expression for eventual lower bound of the concentration of susceptible CD4⁺ T cells, we establish an affirmative partial answer to the numerical simulations investigated in the recent paper [Liu, Wang, Hu and Ma, Global stability of an HIV pathogenesis model with cure rate, Nonlinear Analysis RWA (2011) 12 : 2947–2961]. Our monotone iterative techniques are applicable for the small and large growth rate in logistic functions for the proliferation rate of healthy and infected CD4⁺ T cells. Copyright © 2014 John Wiley & Sons, Ltd.